The nearest colored node in a tree
نویسندگان
چکیده
منابع مشابه
The nearest colored node in a tree
We start a systematic study of data structures for the nearest colored node problem on trees. Given a tree with colored nodes and weighted edges, we want to answer queries (v, c) asking for the nearest node to node v that has color c. This is a natural generalization of the well-known nearest marked ancestor problem. We give an O(n)-space O(log log n)-query solution and show that this is optima...
متن کاملSuccinct data-structure for nearest colored node in a tree
We give a succinct data-structure that stores a tree with colors on the nodes. Given a node x and a color α, the structure finds the nearest node to x with color α. This results improves the O(n log n)-bits structure of Gawrychowski et al. [CPM 2016].
متن کاملThe Colored Quadrant Priority Search Tree with an Application to the all-nearest-foreign-neighbors Problem
Consider a dynamic set of points in the plane having different colors. Let K1 and K2 be two keys according to which points may be sorted, e.g. the xand the y-coordinate. A point p ∈ S is called proper with respect to a query point p0 ∈ S iff K1(p0) < K1(p), K2(p0) < K2(p), and if p has a different color than p0. We present the colored quadrant priority search tree (CQPST) which supports the eff...
متن کاملthe u.s. policy in central asia and its impact on the colored revolutions in the region (the case study of tulip revolution in kyrgyzstan)
چکیده ندارد.
15 صفحه اولNearest Neighbours Search Using the PM-Tree
We introduce a method of searching the k nearest neighbours (k-NN) using PM-tree. The PM-tree is a metric access method for similarity search in large multimedia databases. As an extension of M-tree, the structure of PM-tree exploits local dynamic pivots (like M-tree does it) as well as global static pivots (used by LAESA-like methods). While in M-tree a metric region is represented by a hyper-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.08.021